/**
 * @ClassName LC149
 * @Author ykx
 * @Date 2024/3/29 17:22
 * @Version 1.0
 */
public class LC149 {
    public int maxPoints(int[][] points) {
        int result = 0;
        if (points.length <= 2) {
            return points.length;
        }
        for (int i = 0; i < points.length - 1; i++) {
            //points[i]、points[i+1]构成的解析式:
            if (points[i][1] != points[i + 1][1]) {
                // 斜率存在
                // 斜率k = (points[i + 1][1]-points[i][1])/points[i + 1][0]-points[i][0]

            }
        }
        return result;
    }
}
